THE VIOLATION HEAP: A RELAXED FIBONACCI-LIKE HEAP
نویسندگان
چکیده
منابع مشابه
The Violation Heap: A Relaxed Fibonacci-Like Heap
We give a priority queue that achieves the same amortized bounds as Fibonacci heaps. Namely, find-min requires O(1) worst-case time, insert, meld and decrease-key require O(1) amortized time, and delete-min requires O(log n) amortized time. Our structure is simple and promises an efficient practical behavior when compared to other known Fibonacci-like heaps. The main idea behind our constructio...
متن کاملLeader Election Algorithm in Wireless Environments Using Fibonacci Heap Structure
Today is an era of wireless communication systems. The day is not so far when the whole distributed system of the world will goes wireless. Leader in a distributed system plays a vital role in various computing environments like wireless networks etc. The main focus of researchers is on electing a new leader with lesser time consumption and with transmitting minimum number of messages in the ne...
متن کاملThe Post-order Heap
We propose the post-order heap, a new data structure for implementing priority queues. Our structure is a simple variant of the binary heap that requires only Θ(1) amortized time for Insert operations and O(log n) time in the worst case for Delete-Min operations. Like the binary heap, the post-order heap is an implicit data structure, meaning that a structure containing n elements can be stored...
متن کاملA Selectable Sloppy Heap
We study the selection problem, namely that of computing the ith order statistic of n given elements. Here we offer a data structure called selectable sloppy heap handling a dynamic version in which upon request: (i) a new element is inserted or (ii) an element of a prescribed quantile group is deleted from the data structure. Each operation is executed in (ideal!) constant time— and is thus in...
متن کاملA New Heap Game
Given k ≥ 3 heaps of tokens. The moves of the 2-player game introduced here are to either take a positive number of tokens from at most k − 1 heaps, or to remove the same positive number of tokens from all the k heaps. We analyse this extension of Wythoff’s game and provide a polynomial-time strategy for it.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics, Algorithms and Applications
سال: 2010
ISSN: 1793-8309,1793-8317
DOI: 10.1142/s1793830910000838